Applying Projection-Based Methods to the Asymmetric Traffic Assignment Problem
نویسندگان
چکیده
This paper examines the application of a path-based algorithm, to the static and fixed demand asymmetric traffic assignment problem. The algorithm is of the simplicial decomposition type and it solves the equilibration or master problem step by means of five existing projection methods for variational inequality problems in order to evaluate their performance on real traffic networks. The projection methods evaluated are: a) a cost approximation based method for minimizing the Fukushima's gap function, b) the modified descent method of Zhu and Marcotte (1998), c) the double projection method of Khobotov (1987) and three of its recently developed variants (Nadezhkina and Takhashi (2006), Wang et al. (2010), He et al. (2012)); d) the method of Solodov and Svaiter (1999); and e) the method of Solodov and Tseng (1996). These projection methods do not require evaluation of the jacobians of the path cost functions. The source for asymmetries are link costs with interactions, as in the case of priority ruled junctions. The path-based algorithm has been computationally tested using the previous projection methods on three medium to large networks under different levels of congestion and the computational results are presented and discussed. Comparisons are also made with the basic projection algorithm for the fixed demand asymmetric traffic assignment problem. Despite the lack of monotonicity properties of the test problems, the only method that failed to converge under heavy congestion levels was the basic projection algorithm. The fastest convergence was obtained in all cases solving the master problem step using the method of He et al (2012),which is a variant of Khobotov’s method. . E-mail: [email protected] This is the peer reviewed version of the following article: Codina, E. Ibáñez, G. And Barceló, J. “Applying projectionbased methods to the asymmetric traffic assignment problem”, which has been published in final form at Computer-Aided Civil and Infrastructure Engineering. First published online: 4 FEB 2014. DOI: 10.1111/mice.12069. Research supported under Spanish Research Projects SIMETRIA (Ref. P 63/08, 27.11.2008) and TRA2008-06782-C02-02
منابع مشابه
Different Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملMethods of Reducing the Number of Effective ODs in Order to Solve Traffic Equilibrium Problem in Real Life Networks
Solving traffic equilibrium problem, or “traffic assignment”, as the last step in Transportation Planning, distributes OD trip demands of a transportation network over the network links with regard to Traffic Equilibrium Law, and estimates the link flows. In formulations of traffic equilibrium which are based on path saving, the memory consumption is considerably affected by the number of effct...
متن کاملIdentifying and Analyzing Stop and Go Traffic based on Asymmetric Theory of Driving Behavior in Acceleration and Deceleration
Stop and go traffic that leads to oscillate traffic flow frequently is observed on congestion flow. Unexpected reasons such as lane – changing maneuvers, lower speeds of leader vehicle and moving bottleneck cause stop and go traffic and amplifying delay and environment impacts. Stop and go traffic exactly can’t be modeled by traffic models, and also car following models based on kinematic flow ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comp.-Aided Civil and Infrastruct. Engineering
دوره 30 شماره
صفحات -
تاریخ انتشار 2015